Gradual Semantics for Weighted Bipolar SETAFs
نویسندگان
چکیده
Gradual semantics are now well-studied in the computational argumentation literature. In this paper, we argue that gradual can handle both bipolarity (e.g. attacks and supports) sets of attacking arguments (i.e. several together an argument) might be useful some contexts. We define formal framework properties for such semantics. proceed by adapting, studying implementing three well-known from bipolar literature to new framework.
منابع مشابه
Bipolar Weighted Argumentation Graphs
This paper discusses the semantics of weighted argumentation graphs that are biplor, i.e. contain both attacks and support graphs. The work builds on previous work by Amgoud, Ben-Naim et. al. [1, 2], which presents and compares several semantics for argumentation graphs that contain only supports or only attacks relationships, respectively.
متن کاملOrdered Weighted Averaging Approaches for Aggregating Gradual Trust and Distrust
In this paper, we focus on the aggregation problem for (trust, distrust) couples in trust networks. In particular, we study approaches based on classical and induced ordered weighted averaging (OWA) operators.
متن کاملA Formal Semantics for Weighted Ontology Mappings
Ontology mappings are often assigned a weight or confidence factor by matchers. Nonetheless, few semantic accounts have been given so far for such weights. This paper presents a formal semantics for weighted mappings between different ontologies. It is based on a classificational interpretation of mappings: if O1 and O2 are two ontologies used to classify a common set X , then mappings between ...
متن کاملStructural Operational Semantics for Weighted Transition Systems
Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A general rule format for the SOS specification of weighted systems is obtained via the coalgebraic approach of Turi and Plotkin. Previously known formats for labelled transition systems (GSOS) and stochastic systems (SGSOS...
متن کاملAcceptability Semantics for Weighted Argumentation Frameworks
The paper studies semantics that evaluate arguments in argumentation graphs, where each argument has a basic strength, and may be attacked by other arguments. It starts by defining a set of principles, each of which is a property that a semantics could satisfy. It provides the first formal analysis and comparison of existing semantics. Finally, it defines three novel semantics that satisfy more...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86772-0_15